Using Metrics Suites to Improve the Measurement of Privacy in Graphs

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Social graphs are widely used in research (e.g., epidemiology) and business (e.g., recommender systems). However, sharing these graphs poses privacy risks because they contain sensitive information about individuals. Graph anonymization techniques aim to protect individual users in a graph, while graph de-anonymization aims to re-identify users. The effectiveness of anonymization and de-anonymization algorithms is usually evaluated with privacy metrics. However, it is unclear how strong existing privacy metrics are when they are used in graph privacy. In this paper, we study 26 privacy metrics for graph anonymization and de-anonymization and evaluate their strength in terms of three criteria: monotonicity indicates whether the metric indicates lower privacy for stronger adversaries; for within-scenario comparisons, evenness indicates whether metric values are spread evenly; and for between-scenario comparisons, shared value range indicates whether metrics use a consistent value range across scenarios. Our extensive experiments indicate that no single metric fulfills all three criteria perfectly. We therefore use methods from multi-criteria decision analysis to aggregate multiple metrics in a metrics suite, and we show that these metrics suites improve monotonicity compared to the best individual metric. This important result enables more monotonic, and thus more accurate, evaluations of new graph anonymization and de-anonymization algorithms

On Graph Stream Clustering with Side Information

Graph clustering becomes an important problem due to emerging applications involving the web, social networks and bio-informatics. Recently, many such applications generate data in the form of streams. Clustering massive, dynamic graph streams is significantly challenging because of the complex structures of graphs and computational difficulties of continuous data. Meanwhile, a large volume of side information is associated with graphs, which can be of various types. The examples include the properties of users in social network activities, the meta attributes associated with web click graph streams and the location information in mobile communication networks. Such attributes contain extremely useful information and has the potential to improve the clustering process, but are neglected by most recent graph stream mining techniques. In this paper, we define a unified distance measure on both link structures and side attributes for clustering. In addition, we propose a novel optimization framework DMO, which can dynamically optimize the distance metric and make it adapt to the newly received stream data. We further introduce a carefully designed statistics SGS(C) which consume constant storage spaces with the progression of streams. We demonstrate that the statistics maintained are sufficient for the clustering process as well as the distance optimization and can be scalable to massive graphs with side attributes. We will present experiment results to show the advantages of the approach in graph stream clustering with both links and side information over the baselines.Comment: Full version of SIAM SDM 2013 pape

Human skill capturing and modelling using wearable devices

Industrial robots are delivering more and more manipulation services in manufacturing. However, when the task is complex, it is difficult to programme a robot to fulfil all the requirements because even a relatively simple task such as a peg-in-hole insertion contains many uncertainties, e.g. clearance, initial grasping position and insertion path. Humans, on the other hand, can deal with these variations using their vision and haptic feedback. Although humans can adapt to uncertainties easily, most of the time, the skilled based performances that relate to their tacit knowledge cannot be easily articulated. Even though the automation solution may not fully imitate human motion since some of them are not necessary, it would be useful if the skill based performance from a human could be firstly interpreted and modelled, which will then allow it to be transferred to the robot. This thesis aims to reduce robot programming efforts significantly by developing a methodology to capture, model and transfer the manual manufacturing skills from a human demonstrator to the robot. Recently, Learning from Demonstration (LfD) is gaining interest as a framework to transfer skills from human teacher to robot using probability encoding approaches to model observations and state transition uncertainties. In close or actual contact manipulation tasks, it is difficult to reliabley record the state-action examples without interfering with the human senses and activities. Therefore, wearable sensors are investigated as a promising device to record the state-action examples without restricting the human experts during the skilled execution of their tasks. Firstly to track human motions accurately and reliably in a defined 3-dimensional workspace, a hybrid system of Vicon and IMUs is proposed to compensate for the known limitations of the individual system. The data fusion method was able to overcome occlusion and frame flipping problems in the two camera Vicon setup and the drifting problem associated with the IMUs. The results indicated that occlusion and frame flipping problems associated with Vicon can be mitigated by using the IMU measurements. Furthermore, the proposed method improves the Mean Square Error (MSE) tracking accuracy range from 0.8˚ to 6.4˚ compared with the IMU only method. Secondly, to record haptic feedback from a teacher without physically obstructing their interactions with the workpiece, wearable surface electromyography (sEMG) armbands were used as an indirect method to indicate contact feedback during manual manipulations. A muscle-force model using a Time Delayed Neural Network (TDNN) was built to map the sEMG signals to the known contact force. The results indicated that the model was capable of estimating the force from the sEMG armbands in the applications of interest, namely in peg-in-hole and beater winding tasks, with MSE of 2.75N and 0.18N respectively. Finally, given the force estimation and the motion trajectories, a Hidden Markov Model (HMM) based approach was utilised as a state recognition method to encode and generalise the spatial and temporal information of the skilled executions. This method would allow a more representative control policy to be derived. A modified Gaussian Mixture Regression (GMR) method was then applied to enable motions reproduction by using the learned state-action policy. To simplify the validation procedure, instead of using the robot, additional demonstrations from the teacher were used to verify the reproduction performance of the policy, by assuming human teacher and robot learner are physical identical systems. The results confirmed the generalisation capability of the HMM model across a number of demonstrations from different subjects; and the reproduced motions from GMR were acceptable in these additional tests. The proposed methodology provides a framework for producing a state-action model from skilled demonstrations that can be translated into robot kinematics and joint states for the robot to execute. The implication to industry is reduced efforts and time in programming the robots for applications where human skilled performances are required to cope robustly with various uncertainties during tasks execution

Solution to a problem of Luca, Menares and Pizarro-Madariaga

Let $k\ge 2$ be a positive integer and $P^+(n)$ the greatest prime factor of a positive integer $n$ with convention $P^+(1)=1$. For any $\theta\in \left[\frac 1{2k},\frac{17}{32k}\right)$, set $$T_{k,\theta}(x)=\sum_{\substack{p_1\cdot\cdot\cdot p_k\le x\\ P^+(\gcd(p_1-1,...,p_k-1))\ge (p_1\cdot\cdot\cdot p_k)^\theta}}1,$$ where the $p'$s are primes. It is proved that $$T_{k,\theta}(x)\asymp_{k}\frac{x^{1-\theta(k-1)}}{(\log x)^2},$$ which answers a 2015 problem of Luca, Menares and Pizarro-Madariaga on the exact order of magnitude of $T_{k,\theta}(x)$. A main novelty in the proof is that, instead of using the Brun--Titchmarsh theorem to estimate the $k^{th}$ movement of primes in arithmetic progressions, we transform the movement to an estimation involving taking primes simultaneously by linear shifts of primes

On the Strength of Privacy Metrics for Vehicular Communication

open access articl

A robust reputation-based location-privacy recommender system using opportunistic networks

Location-sharing services have grown in use commensurately with the increasing popularity of smart phones. As location data can be sensitive, it is important to preserve people’s privacy while using such services, and so location-privacy recommender systems have been proposed to help people configure their privacy settings.These recommenders collect and store people’s data in a centralised system, but these themselves can introduce new privacy threats and concerns.In this paper, we propose a decentralised location-privacy recommender system based on opportunistic networks. We evaluate our system using real-world location-privacy traces, and introduce a reputation scheme based on encounter frequencies to mitigate the potential effects of shilling attacks by malicious users. Experimental results show that, after receiving adequate data, our decentralised recommender system’s performance is close to the performance of traditional centralised recommender systems (3% difference in accuracy and 1% difference in leaks). Meanwhile, our reputation scheme significantly mitigates the effect of malicious users’input (from 55% to 8% success) and makes it increasingly expensive to conduct such attacks.Postprin

On a conjecture of Ram\'{\i}rez Alfons\'{\i}n and Ska{\l}ba II

Let $1<c<d$ be two relatively prime integers and $g_{c,d}=cd-c-d$. We confirm, by employing the Hardy--Littlewood method, a 2020 conjecture of Ram\'{\i}rez Alfons\'{\i}n and Ska{\l}ba which states that #\left\{p\le g_{c,d}:p\in \mathcal{P}, ~p=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}\right\}\sim \frac{1}{2}\pi\left(g_{c,d}\right) \quad (\text{as}~c\rightarrow\infty), where $\mathcal{P}$ is the set of primes, $\mathbb{Z}_{\geqslant0}$ is the set of nonnegative integers and $\pi(t)$ denotes the number of primes not exceeding $t$

Recommending privacy preferences in location-sharing services

Location-sharing services have become increasingly popular with the proliferation of smartphones and online social networks. People share their locations with each other to record their daily lives or satisfy their social needs. At the same time, inappropriate disclosure of location information poses threats to people's privacy. One of the reasons why people fail to protect their location privacy is the difficulty of using the current mechanisms to manually configure location-privacy settings. Since people's location-privacy preferences are context-aware, manual configuration is cumbersome. People's incapability and unwillingness to do so lead to unexpected location disclosures that violate their location privacy. In this thesis, we investigate the feasibility of using recommender systems to help people protect their location privacy. We examine the performance of location-privacy recommender systems and compare it with the state-of-the-art. We also conduct online user studies to understand people's acceptance of such recommender systems and their concerns. We revise our design of the systems according to the results of the user studies. We find that user-based collaborative filtering can accurately recommend location-privacy preferences and outperform the state-of-the-art when training data are insufficient. From users' perspective, their acceptance of location-privacy recommender systems is affected by the openness and the context of recommendations and their privacy concerns about the systems. It is feasible to use data obfuscation or decentralisation to alleviate people's concerns and meanwhile keep the systems robust against malicious data attacks